Multiobjective Variable Neighborhood Search algorithm for scheduling independent jobs on computational grid
نویسندگان
چکیده
منابع مشابه
Scheduling Independent Jobs on Computational Grid using Biogeography Based Optimization Algorithm for Makespan Reduction
Due to the development of information and network technologies, idle computers all over the world can be organized and utilized to enhance the overall computation performance. Grid computing refers to the combination of computer resources from multiple administrative domains used to reach a common goal. Grids offer a way of using the information technology resources optimally inside an organiza...
متن کاملScheduling jobs on computational grid using Differential Evolution algorithm
-Large scale computation is frequently limited to the performance of computer hardware or associated cost. Due to the development of information and network technologies, idle computers all over the world can be utilized and organized to enhance overall computation performance. Grid environments facilitate distributed computation. Hence the scheduling of grid jobs should be considered as an imp...
متن کاملMultiobjective Evolutionary Algorithms for Scheduling Jobs on Computational Grids
In a computational grid, at time t, the task is to allocate the user defined jobs efficiently by meeting the deadlines and making use of all the available resources. In the past, objectives were combined and the problem is very often simplified to a single objective problem. In this paper, we formulate a novel Evolutionary Multi-Objective (EMO) approach by using the Pareto dominance and the obj...
متن کاملIndependent Task Scheduling by Hybrid Algorithm of Harmony Search and Variable Neighborhood Search
A new hybrid algorithm is proposed in this paper. An independent task scheduling algorithm is designed based on the hybrid algorithm. The hybrid algorithm adopt list scheduling method to code harmony solution and convert harmony vector to priority-based independent task scheduling model, and perform variable neighborhood search on harmony solutions to improve Harmony Search efficiency and solut...
متن کاملA Tabu Search Algorithm for Scheduling Independent Jobs in Computational Grids
The efficient allocation of jobs to grid resources is indispensable for high performance grid-based applications, and it is a computationally hard problem even when there are no dependencies among jobs. We present in this paper a new tabu search (TS) algorithm for the problem of batch job scheduling on computational grids. We define it as a bi-objective optimization problem, consisting of the m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Egyptian Informatics Journal
سال: 2015
ISSN: 1110-8665
DOI: 10.1016/j.eij.2015.06.001